1 0 O ct 2 01 2 Comparing several heuristics for a packing problem
نویسندگان
چکیده
Packing problems are in general NP-hard, even for simple cases. Since now there are no highly efficient algorithms available for solving packing problems. The two-dimensional bin packing problem is about packing all given rectangular items, into a minimum size rectangular bin, without overlapping. The restriction is that the items cannot be rotated. The current paper is comparing a greedy algorithm with a hybrid genetic algorithm in order to see which technique is better for the given problem. The algorithms are tested on different sizes data.
منابع مشابه
Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing
We consider the one-dimensional bin packing problem under the discrete uniform distributions U{j, k}, 1 ≤ j ≤ k − 1, in which the bin capacity is k and item sizes are chosen uniformly from the set {1, 2, . . . , j}. Note that for 0 < u = j/k ≤ 1 this is a discrete version of the previously studied continuous uniform distribution U(0, u], where the bin capacity is 1 and item sizes are chosen uni...
متن کاملar X iv : 1 71 0 . 05 14 0 v 1 [ cs . C C ] 1 4 O ct 2 01 7 On complexity of multidistance graph recognition in R 1 Mikhail Tikhomirov
Let A be a set of positive numbers. A graph G is called an Aembeddable graph in R if the vertices of G can be positioned in R so that the distance between endpoints of any edge is an element of A. We consider the computational problem of recognizing A-embeddable graphs in R1 and classify all finite sets A by complexity of this problem in several natural variations.
متن کاملFast Error-Tolerant Quartet Phylogeny Algorithms
We present an algorithm for phylogenetic reconstruction using quartets that returns the correct topology for n taxa in O(n logn) time with high probability, in a probabilistic model where a quartet is not consistent with the true topology of the tree with constant probability, independent of other quartets. Our incremental algorithm relies upon a search tree structure for the phylogeny that is ...
متن کاملA Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1, . . . , an in (0, 1]. Using uniform sampling, which selects a random element from the input list each time, we develop a randomized O( n)(log log n) ∑n i=1 ai +( 1 2 ) 1 2 ) time (1+2)approximation scheme for the bin packing problem. We show that every randomized algorithm with unifo...
متن کاملA remark on Lipschitz stability for inverse problems
An abstract Lipschitz stability estimate is proved for a class of inverse problems. It is then applied to the inverse Robin problem for the Laplace equation and to the inverse medium problem for the Helmholtz equation. Key-words: Derivative in the sense of Fréchet, Lipschitz stability, inverse Robin problem, inverse medium problem ha l-0 07 41 89 2, v er si on 1 15 O ct 2 01 2 Une remarque sur ...
متن کامل